Interval vs. Point Temporal Logic Model Checking
نویسندگان
چکیده
منابع مشابه
Interval vs. Point Temporal Logic Model Checking: an Expressiveness Comparison
In the last years, model checking with interval temporal logics is emerging as a viable alternative to model checking with standard point-based temporal logics, such as LTL, CTL, CTL∗, and the like. The behavior of the system is modelled by means of (finite) Kripke structures, as usual. However, while temporal logics which are interpreted “point-wise” describe how the system evolves state-by-st...
متن کاملModel Checking Cryptographic Protocols with Interval Temporal Logic
This paper investigates model-checking Needham-Schroeder Public-Keyprotocol using Propositio nal Projection Temporal Logic (PPTL). To this end, the ProMeLa model of the protocol is firstly constructed then the properties to verify is specified by PPTL formulas, which is translated into automata and further to Never Claim. The transformation is by the method we present and is implemented by an a...
متن کاملTemporal Logic Model Checking
ion reduces the state space by removing irrelevant features of a Kripke structure. Given a Kripke structure K, an abstraction is a Kripke structure K̂ such that K̂ is significantly smaller than K, and K̂ preserves a useful class of specifications for K. Consequently, the expensive task of model checking K can be reduced to the more feasible task of model checking K̂. We know from above that in orde...
متن کاملPlanning temporal events using point-interval logic
The paper presents a temporal logic and its application to planning time-critical missions. An extended version of the Point–Interval Logic (PIL) is presented that incorporates both point and interval descriptions of time. The points and intervals in this formalism represent time stamps and time delays, respectively, associated with events/activities in a mission as constraints on or as resulta...
متن کاملModel Checking Fixed Point Logic with Chop
This paper examines FLC, which is the modal μ-calculus enriched with a sequential composition operator. Bisimulation invariance and the tree model property are proved. Its succinctness is compared to the modal μ-calculus. The main focus lies on FLC’s model checking problem over finite transition systems. It is proved to be PSPACE-hard. A tableau model checker is given and an upper EXPTIME bound...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: ACM Transactions on Computational Logic
سال: 2019
ISSN: 1529-3785,1557-945X
DOI: 10.1145/3281028